<title>「NOIP2017」奶酪</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cmath&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define MAXN 1005</span>
<span class="pl-kt">int</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">];</span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">][</span><span class="pl-mi">3</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-nf">find</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">){</span>
    <span class="pl-k">return</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span><span class="pl-o">==</span><span class="pl-n">x</span><span class="pl-o">?</span><span class="pl-nl">x</span><span class="pl-p">:(</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]));</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">join</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">b</span><span class="pl-p">){</span>
    <span class="pl-c1">//printf(&quot;%d %d joined\n&quot;,a,b);</span>
    <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-p">)]</span><span class="pl-o">=</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">b</span><span class="pl-p">);</span>
<span class="pl-p">}</span>
<span class="pl-kt">double</span> <span class="pl-nf">dis</span><span class="pl-p">(</span><span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">b</span><span class="pl-p">){</span>
    <span class="pl-k">return</span> <span class="pl-n">sqrt</span><span class="pl-p">((</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">b</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">])</span><span class="pl-o">*</span><span class="pl-p">(</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">b</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">])</span><span class="pl-o">+</span><span class="pl-p">(</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">b</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">])</span><span class="pl-o">*</span><span class="pl-p">(</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">b</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">])</span><span class="pl-o">+</span><span class="pl-p">(</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">b</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">])</span><span class="pl-o">*</span><span class="pl-p">(</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">b</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">]));</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
    <span class="pl-kt">int</span> <span class="pl-n">zn</span><span class="pl-p">;</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">zn</span><span class="pl-p">);</span>
    <span class="pl-k">while</span><span class="pl-p">(</span><span class="pl-n">zn</span><span class="pl-o">--</span><span class="pl-p">){</span>
        <span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">h</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">;</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">h</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">r</span><span class="pl-p">);</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-o">+</span><span class="pl-mi">2</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">i</span><span class="pl-p">;</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld%lld%lld&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">0</span><span class="pl-p">],</span><span class="pl-o">&amp;</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">1</span><span class="pl-p">],</span><span class="pl-o">&amp;</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">]);</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
            <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">]</span><span class="pl-o">&lt;=</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-n">join</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-o">+</span><span class="pl-mi">2</span><span class="pl-p">);</span>
            <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">h</span><span class="pl-o">-</span><span class="pl-n">data</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-mi">2</span><span class="pl-p">]</span><span class="pl-o">&lt;=</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-n">join</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">);</span>
            <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">++</span><span class="pl-p">){</span>
                <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-o">==</span><span class="pl-n">j</span><span class="pl-p">)</span><span class="pl-k">continue</span><span class="pl-p">;</span>
                <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">dis</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">,</span><span class="pl-n">j</span><span class="pl-p">)</span><span class="pl-o">&lt;=</span><span class="pl-mi">2</span><span class="pl-o">*</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-n">join</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">,</span><span class="pl-n">j</span><span class="pl-p">);</span>
            <span class="pl-p">}</span>
        <span class="pl-p">}</span>
        <span class="pl-c1">//for(int i=1;i&lt;=n+2;i++)printf(&quot;%d &quot;,f[i]);</span>
        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%s</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">n</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">==</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">n</span><span class="pl-o">+</span><span class="pl-mi">2</span><span class="pl-p">)</span><span class="pl-o">?</span><span class="pl-s">&quot;Yes&quot;</span><span class="pl-o">:</span><span class="pl-s">&quot;No&quot;</span><span class="pl-p">);</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>